Sub-Graphs of Complete Graph
نویسنده
چکیده
In the complete graph K2m+3 for m ≥ 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m ≥ 2 . The various structures of the form H(2m+3, 6m+3) for m ≥ 2 are found and some of them are observed to give some forms of metal atom cluster compound of chemistry . Finally, we establish an algorithm to solve the traveling salesman problem when the weights of edges of the complete graph K 2m+3 for m ≥ 2 are non-repeated in the case of symmetrical problems. The applications of the sub-graphs H (2m+3,6m+3) for m ≥ 2 are shown in the solution of traveling salesman problem . KeywordsComplete graph, Hamiltonian simple sub-graph, Non-isomorphic graph, cluster compounds, Tsp .
منابع مشابه
Finding Community Base on Web Graph Clustering
Search Pointers organize the main part of the application on the Internet. However, because of Information management hardware, high volume of data and word similarities in different fields the most answers to the user s’ questions aren`t correct. So the web graph clustering and cluster placement in corresponding answers helps user to achieve his or her intended results. Community (web communit...
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملOn the revised edge-Szeged index of graphs
The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...
متن کاملRemainder Cordial Labeling of Graphs
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...
متن کاملBorderenergetic graphs of order 12
A graph G of order n is said to be borderenergetic if its energy is equal to 2n-2 and if G differs from the complete graph Kn. The first such graph was discovered in 2001, but their systematic study started only in 2015. Until now, the number of borderenergetic graphs of order n was determined for n
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کامل